TSTP Solution File: ITP161^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP161^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:07:10 EDT 2024
% Result : Theorem 0.43s 0.68s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 18
% Syntax : Number of formulae : 30 ( 7 unt; 13 typ; 0 def)
% Number of atoms : 30 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 112 ( 12 ~; 8 |; 1 &; 88 @)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 0 ^ 19 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_sort2,type,
refine424419629nres_a: $tType ).
thf(decl_sort3,type,
refine432681134nres_b: $tType ).
thf(decl_sort4,type,
set_a: $tType ).
thf(decl_37,type,
ord_le527798542nres_b: refine432681134nres_b > refine432681134nres_b > $o ).
thf(decl_75,type,
refine436832839nd_a_b: refine424419629nres_a > ( a > refine432681134nres_b ) > refine432681134nres_b ).
thf(decl_107,type,
refine1198353288_RES_a: set_a > refine424419629nres_a ).
thf(decl_127,type,
collect_a: ( a > $o ) > set_a ).
thf(decl_134,type,
member_a: a > set_a > $o ).
thf(decl_136,type,
phi: a > $o ).
thf(decl_137,type,
f: a > refine432681134nres_b ).
thf(decl_138,type,
m: refine432681134nres_b ).
thf(decl_139,type,
x: a ).
thf(conj_0,conjecture,
ord_le527798542nres_b @ m @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ ( collect_a @ phi ) ) @ f ),
file('/export/starexec/sandbox2/tmp/tmp.6QfPwtnhVy/E---3.1_27717.p',conj_0) ).
thf(fact_35_RES__bind__choose,axiom,
! [X96: a,X97: set_a,X98: refine432681134nres_b,X99: a > refine432681134nres_b] :
( ( member_a @ X96 @ X97 )
=> ( ( ord_le527798542nres_b @ X98 @ ( X99 @ X96 ) )
=> ( ord_le527798542nres_b @ X98 @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ X97 ) @ X99 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6QfPwtnhVy/E---3.1_27717.p',fact_35_RES__bind__choose) ).
thf(fact_1_assms_I2_J,axiom,
ord_le527798542nres_b @ m @ ( f @ x ),
file('/export/starexec/sandbox2/tmp/tmp.6QfPwtnhVy/E---3.1_27717.p',fact_1_assms_I2_J) ).
thf(fact_107_mem__Collect__eq,axiom,
! [X266: a,X267: a > $o] :
( ( member_a @ X266 @ ( collect_a @ X267 ) )
<=> ( X267 @ X266 ) ),
file('/export/starexec/sandbox2/tmp/tmp.6QfPwtnhVy/E---3.1_27717.p',fact_107_mem__Collect__eq) ).
thf(fact_0_assms_I1_J,axiom,
phi @ x,
file('/export/starexec/sandbox2/tmp/tmp.6QfPwtnhVy/E---3.1_27717.p',fact_0_assms_I1_J) ).
thf(c_0_5,negated_conjecture,
~ ( ord_le527798542nres_b @ m @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ ( collect_a @ phi ) ) @ f ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_6,plain,
! [X1311: a,X1312: set_a,X1313: refine432681134nres_b,X1314: a > refine432681134nres_b] :
( ~ ( member_a @ X1311 @ X1312 )
| ~ ( ord_le527798542nres_b @ X1313 @ ( X1314 @ X1311 ) )
| ( ord_le527798542nres_b @ X1313 @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ X1312 ) @ X1314 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_35_RES__bind__choose])])]) ).
thf(c_0_7,negated_conjecture,
~ ( ord_le527798542nres_b @ m @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ ( collect_a @ phi ) ) @ f ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X5: set_a,X17: refine432681134nres_b,X99: a > refine432681134nres_b,X42: a] :
( ( ord_le527798542nres_b @ X17 @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ X5 ) @ X99 ) )
| ~ ( member_a @ X42 @ X5 )
| ~ ( ord_le527798542nres_b @ X17 @ ( X99 @ X42 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
ord_le527798542nres_b @ m @ ( f @ x ),
inference(split_conjunct,[status(thm)],[fact_1_assms_I2_J]) ).
thf(c_0_10,negated_conjecture,
~ ( ord_le527798542nres_b @ m @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ ( collect_a @ phi ) ) @ f ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X5: set_a] :
( ( ord_le527798542nres_b @ m @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ X5 ) @ f ) )
| ~ ( member_a @ x @ X5 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,plain,
! [X1350: a,X1351: a > $o] :
( ( ~ ( member_a @ X1350 @ ( collect_a @ X1351 ) )
| ( X1351 @ X1350 ) )
& ( ~ ( X1351 @ X1350 )
| ( member_a @ X1350 @ ( collect_a @ X1351 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_107_mem__Collect__eq])])]) ).
thf(c_0_13,negated_conjecture,
~ ( member_a @ x @ ( collect_a @ phi ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,plain,
! [X21: a > $o,X42: a] :
( ( member_a @ X42 @ ( collect_a @ X21 ) )
| ~ ( X21 @ X42 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_15,plain,
phi @ x,
inference(split_conjunct,[status(thm)],[fact_0_assms_I1_J]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.18 % Problem : ITP161^1 : TPTP v8.1.2. Released v7.5.0.
% 0.17/0.19 % Command : run_E %s %d THM
% 0.19/0.40 % Computer : n028.cluster.edu
% 0.19/0.40 % Model : x86_64 x86_64
% 0.19/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.40 % Memory : 8042.1875MB
% 0.19/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.40 % CPULimit : 300
% 0.19/0.40 % WCLimit : 300
% 0.19/0.40 % DateTime : Fri May 3 12:39:49 EDT 2024
% 0.19/0.40 % CPUTime :
% 0.26/0.58 Running higher-order theorem proving
% 0.26/0.58 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.6QfPwtnhVy/E---3.1_27717.p
% 0.43/0.68 # Version: 3.1.0-ho
% 0.43/0.68 # Preprocessing class: HSLMSMSMSSMCHSA.
% 0.43/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.68 # Starting new_ho_10 with 1500s (5) cores
% 0.43/0.68 # Starting sh5l with 300s (1) cores
% 0.43/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.43/0.68 # Starting new_bool_2 with 300s (1) cores
% 0.43/0.68 # new_bool_1 with pid 27798 completed with status 0
% 0.43/0.68 # Result found by new_bool_1
% 0.43/0.68 # Preprocessing class: HSLMSMSMSSMCHSA.
% 0.43/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.68 # Starting new_ho_10 with 1500s (5) cores
% 0.43/0.68 # Starting sh5l with 300s (1) cores
% 0.43/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.43/0.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.43/0.68 # Search class: HGUSM-FSLM32-DHSFFSBN
% 0.43/0.68 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.68 # Starting new_ho_10 with 163s (1) cores
% 0.43/0.68 # new_ho_10 with pid 27801 completed with status 0
% 0.43/0.68 # Result found by new_ho_10
% 0.43/0.68 # Preprocessing class: HSLMSMSMSSMCHSA.
% 0.43/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.68 # Starting new_ho_10 with 1500s (5) cores
% 0.43/0.68 # Starting sh5l with 300s (1) cores
% 0.43/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.43/0.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.43/0.68 # Search class: HGUSM-FSLM32-DHSFFSBN
% 0.43/0.68 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.68 # Starting new_ho_10 with 163s (1) cores
% 0.43/0.68 # Preprocessing time : 0.005 s
% 0.43/0.68 # Presaturation interreduction done
% 0.43/0.68
% 0.43/0.68 # Proof found!
% 0.43/0.68 # SZS status Theorem
% 0.43/0.68 # SZS output start CNFRefutation
% See solution above
% 0.43/0.68 # Parsed axioms : 503
% 0.43/0.68 # Removed by relevancy pruning/SinE : 388
% 0.43/0.68 # Initial clauses : 238
% 0.43/0.68 # Removed in clause preprocessing : 43
% 0.43/0.68 # Initial clauses in saturation : 195
% 0.43/0.68 # Processed clauses : 518
% 0.43/0.68 # ...of these trivial : 13
% 0.43/0.68 # ...subsumed : 106
% 0.43/0.68 # ...remaining for further processing : 399
% 0.43/0.68 # Other redundant clauses eliminated : 87
% 0.43/0.68 # Clauses deleted for lack of memory : 0
% 0.43/0.68 # Backward-subsumed : 1
% 0.43/0.68 # Backward-rewritten : 6
% 0.43/0.68 # Generated clauses : 1064
% 0.43/0.68 # ...of the previous two non-redundant : 823
% 0.43/0.68 # ...aggressively subsumed : 0
% 0.43/0.68 # Contextual simplify-reflections : 6
% 0.43/0.68 # Paramodulations : 898
% 0.43/0.68 # Factorizations : 2
% 0.43/0.68 # NegExts : 0
% 0.43/0.68 # Equation resolutions : 90
% 0.43/0.68 # Disequality decompositions : 0
% 0.43/0.68 # Total rewrite steps : 255
% 0.43/0.68 # ...of those cached : 188
% 0.43/0.68 # Propositional unsat checks : 0
% 0.43/0.68 # Propositional check models : 0
% 0.43/0.68 # Propositional check unsatisfiable : 0
% 0.43/0.68 # Propositional clauses : 0
% 0.43/0.68 # Propositional clauses after purity: 0
% 0.43/0.68 # Propositional unsat core size : 0
% 0.43/0.68 # Propositional preprocessing time : 0.000
% 0.43/0.68 # Propositional encoding time : 0.000
% 0.43/0.68 # Propositional solver time : 0.000
% 0.43/0.68 # Success case prop preproc time : 0.000
% 0.43/0.68 # Success case prop encoding time : 0.000
% 0.43/0.68 # Success case prop solver time : 0.000
% 0.43/0.68 # Current number of processed clauses : 207
% 0.43/0.68 # Positive orientable unit clauses : 42
% 0.43/0.68 # Positive unorientable unit clauses: 0
% 0.43/0.68 # Negative unit clauses : 7
% 0.43/0.68 # Non-unit-clauses : 158
% 0.43/0.68 # Current number of unprocessed clauses: 644
% 0.43/0.68 # ...number of literals in the above : 2038
% 0.43/0.68 # Current number of archived formulas : 0
% 0.43/0.68 # Current number of archived clauses : 171
% 0.43/0.68 # Clause-clause subsumption calls (NU) : 4459
% 0.43/0.68 # Rec. Clause-clause subsumption calls : 3318
% 0.43/0.68 # Non-unit clause-clause subsumptions : 110
% 0.43/0.68 # Unit Clause-clause subsumption calls : 164
% 0.43/0.68 # Rewrite failures with RHS unbound : 0
% 0.43/0.68 # BW rewrite match attempts : 30
% 0.43/0.68 # BW rewrite match successes : 3
% 0.43/0.68 # Condensation attempts : 518
% 0.43/0.68 # Condensation successes : 3
% 0.43/0.68 # Termbank termtop insertions : 37346
% 0.43/0.68 # Search garbage collected termcells : 8667
% 0.43/0.68
% 0.43/0.68 # -------------------------------------------------
% 0.43/0.68 # User time : 0.064 s
% 0.43/0.68 # System time : 0.010 s
% 0.43/0.68 # Total time : 0.074 s
% 0.43/0.68 # Maximum resident set size: 3800 pages
% 0.43/0.68
% 0.43/0.68 # -------------------------------------------------
% 0.43/0.68 # User time : 0.078 s
% 0.43/0.68 # System time : 0.014 s
% 0.43/0.68 # Total time : 0.093 s
% 0.43/0.68 # Maximum resident set size: 2884 pages
% 0.43/0.68 % E---3.1 exiting
% 0.43/0.68 % E exiting
%------------------------------------------------------------------------------